Structured semidefinite programs for the control of symmetric systems
نویسندگان
چکیده
In this paper we show how the symmetry present in many linear systems can be exploited to significantly reduce the computational effort required for controller synthesis. This approach may be applied when controller design specifications are expressible via semidefinite programming. In particular, when the overall system description is invariant under unitary coordinate transformations of the state space matrices, synthesis semidefinite programs can be decomposed into a collection of smaller semidefinite programs. c © 2008 Elsevier Ltd. All rights reserved.
منابع مشابه
On Structured Semidefinite Programs for the Control of Symmetric Systems
In this paper we show how the symmetry present in many linear systems can be exploited to significantly reduce the computational effort required for controller synthesis. This approach may be applied when controller design specifications are expressible as a semidefinite program. In particular, when the overall system description is invariant under unitary coordinate transformations of the stat...
متن کاملA Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کاملExtension and Implementation of Homogeneous Self-dual Methods for Symmetric Cones under Uncertainty
Homogeneous self-dual algorithms for stochastic semidefinite programs with finite event space has been proposed by Jin et al. in [12]. Alzalg [8], has adopted their work to derive homogeneous self-dual algorithms for stochastic second-order programs with finite event space. In this paper, we generalize these two results to derive homogeneous self-dual algorithms for stochastic programs with fin...
متن کاملPolynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
We establish polynomial-time convergence of infeasible-interior-point methods for conic programs over symmetric cones using a wide neighborhood of the central path. The convergence is shown for a commutative family of search directions used in Schmieta and Alizadeh [9]. These conic programs include linear and semidefinite programs. This extends the work of Rangarajan and Todd [8], which establi...
متن کاملBad semidefinite programs with short proofs, and the closedness of the linear image of the semidefinite cone
Semidefinite programs (SDPs) – some of the most useful and pervasive optimization problems of the last few decades – often behave pathologically: the optimal values of the primal and dual problems may differ and may not be attained. Such SDPs are theoretically interesting and often impossible to solve. Yet, the pathological SDPs in the literature look strikingly similar, and our recent paper [1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Automatica
دوره 44 شماره
صفحات -
تاریخ انتشار 2008